Local Heaviside‐weighted LRPIM meshless method and its application to two‐dimensional potential flows

In this paper, the local radial point interpolation meshless method (LRPIM) is used for the analysis of two‐dimensional potential flows, based on a local‐weighted residual method with the Heaviside step function as the weighting function over a local subdomain. Trial functions are constructed using radial basis functions. The present method is a truly meshless method based only on a number of randomly located nodes. Integration over the subdomains requires only a simple integration cell to obtain the solution. No element matrix assembly is required and no special treatment is needed to impose the essential boundary conditions. The novelty of the paper is the use of a local Heaviside weight function in the LRPIM, which does not need local domain integration and integrations only on the boundary of the local domains are needed. Effects of the sizes of local subdomain and interpolation domain on the performance of the present method are investigated. The behavior of shape parameters of multiquadrics has been systematically studied. Two numerical tests in groundwater and fluid flows are presented and compared with closed‐form solutions and finite element method. The results show that the use of a local Heaviside weight function in the LRPIM is highly accurate and possesses no numerical difficulties. Copyright © 2008 John Wiley & Sons, Ltd.     

二元三次样条空间S31,2(Δmn(2)) 的样条拟插值

本文首先利用由两组具有局部最小支集的样条所组成的基函数,构造非均匀2 型三角剖分上二元三次样条空间S₃^1,2(Δ_mn⁽²⁾)的若干样条拟插值算子. 这些变差缩减算子由样条函数B_ij¹支集上5 个网格点或中心和样条函数B_ij²支集上5 个网格点处函数值定义. 这些样条拟插值算子具有较好的逼近性,甚至算子V_mn（f） 能保持近最优的三次多项式性. 然后利用连续模,分析样条拟插值算子V_mn（f）一致逼近于充分光滑的实函数. 最后推导误差估计.     

基于多元二次径向基神经网络的偏微分求解方法

为提高偏微分方程的计算求解精度,设计了以多元二次径向基神经网络为求解单元的偏微分计算方法,给出了多元二次径向基神经网络的具体求解结构,并以此神经网络为求解基础,给出了具体的偏微分计算步骤.通过具体的偏微分求解实例验证方法的有效性,并以3种不同设计样本数构建的多元二次径向基神经网络为计算单元,从实例求解所需的计算时间以及解的精度作对比,结果表明,采用基于多元二次径向基神经网络的偏微分方程求解方法具有求解精度高以及计算效率低等特点.     

Quadratic spline quasi-interpolants on Powell-Sabin partitions

In this paper we address the problem of constructing quasi-interpolants in the space of quadratic Powell-Sabin splines on nonuniform triangulations. Quasi-interpolants of optimal approximation order are proposed and numerical tests are presented. Dedicated to Prof. Mariano Gasca on the occasion of his 60th birthday.     

Kernel B-splines and interpolation

This paper applies difference operators to conditionally positive definite kernels in order to generate kernel -splines that have fast decay towards infinity. Interpolation by these new kernels provides better condition of the linear system, while the kernel -spline inherits the approximation orders from its native kernel. We proceed in two different ways: either the kernel -spline is constructed adaptively on the data knot set , or we use a fixed difference scheme and shift its associated kernel -spline around. In the latter case, the kernel -spline so obtained is strictly positive in general. Furthermore, special kernel -splines obtained by hexagonal second finite differences of multiquadrics are studied in more detail. We give suggestions in order to get a consistent improvement of the condition of the interpolation matrix in applications.     

Construction Techniques for Highly Accurate Quasi-Interpolation Operators

Under mild additional assumptions this paper constructs quasi-interpolants in the form

Full-size image

with approximation order ℓ−1, where_h(x) is a linear combination of translatesψ(x−jh) of a functionψinC^ℓ( ). Thus the order of convergence of such operators can be pushed up to a limit that only depends on the smoothness of the functionψ. This approach can be generalized to the multivariate setting by using discrete convolutions with tensor products of odd-degreeB-splines.     

A numerical method for solving KdV equation with multilevel B-spline quasi-interpolation

In this article, we use a multilevel quartic spline quasi-interpolation scheme to solve the one-dimensional nonlinear Korteweg–de Vries (KdV) equation which exhibits a large number of physical phenomena. The presented scheme is obtained by using the second-order central divided difference of the spatial derivative to approximate the third-order spatial derivative, and the forward divided difference to approximate the temporal derivative, where the spatial derivative is approximated by the proposed quasi-interpolation operator. Compared to other numerical methods, the main advantages of our scheme are the higher accuracy and lower computational complexity. Meanwhile, the algorithm is very simple and easy to implement. Numerical experiments in this article also show that our scheme is feasible and valid.     

Solving Delay Differential Equations Through RBF Collocation

A general and easy-to-code numerical method based on radial basis functions (RBFs) collocation is proposed for the solution of delay differential equations (DDEs). It relies on the interpolation properties of infinitely smooth RBFs, which allow for a large accuracy over a scattered and relatively small discretization support. Hardy's multiquadric is chosen as RBF and combined with the Residual Subsampling Algorithm of Driscoll and Heryudono for support adaptivity. The performance of the method is very satisfactory, as demonstrated over a cross-section of benchmark DDEs, and by comparison with existing general-purpose and specialized numerical schemes for DDEs.     

Generator,multiquadric generator,quasi-interpolation and multiquadric quasi-interpolation

The aim of this survey paper is to propose a new concept “generator”. In fact, generator is a single function that can generate the basis as well as the whole function space. It is a more fundamental concept than basis. Various properties of generator are also discussed. Moreover, a special generator named multiquadric function is introduced. Based on the multiquadric generator, the multiquadric quasi-interpolation scheme is constructed, and furthermore, the properties of this kind of quasi-interpolation are discussed to show its better capacity and stability in approximating the high order derivatives.     

一种2型三角剖分上多元样条拟插值的精度提高策略

给定一个多元拟插值算子, 若其具有单位分解性质 (再生0次多项式), 我们提出一种利用其周围节点提高多项式再生性的方法. 所得算子不仅具有更高的逼近精度, 还不需要目标函数的任何导数信息. 然后利用此方法, 我们改进了2型三角剖分上的多元样条拟插值,使之具有更高的精度. 最后, 我们应用改进的拟插值算子数值求解时间发展偏微分方程. 数值实验验证了该方法的有效性.